/*
*	ID : Pallab
* 	PROG : C
* 	LANG : C++
* 	2012-09-15-01.32.01 Saturday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

template<class T1>
inline void debug(T1 _x) {
    cout<<_x<<'\n';
}
template<class T1, class T2>
inline void debug(T1 _x,T2 _y) {
    cout<<_x<<' '<<_y<<'\n';
}
template<class T1, class T2, class T3>
inline void debug(T1 _x,T2 _y,T3 _z) {
    cout<<_x<<' '<<_y<<' '<<_z<<'\n';
}
template<class T1, class T2, class T3, class T4>
inline void debug(T1 _x,T2 _y,T3 _z,T4 _zz) {
    cout<<_x<<' '<<_y<<' '<<_z<<' '<<_zz<<'\n';
}
template< class T1>
inline void debug(T1 _array,int _size) {
    cout<<"[";
    for (int i=0; i<_size; ++i) {
        cout<<' '<<_array[i];
    }
    puts(" ]");
}
inline bool CI(int &_x) {
    return scanf("%d",&_x)==1;
}
inline bool CI(int &_x, int &_y) {
    return CI(_x)&&CI(_y) ;
}
inline bool CI(int &_x, int &_y, int &_z) {
    return CI(_x)&&CI(_y)&&CI(_z) ;
}
inline bool CI(int &_x, int &_y, int &_z, int &_zz) {
    return CI(_x)&&CI(_y)&&CI(_z)&&CI(_zz) ;
}
inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ) {
        ;
    }
}
#if !defined( ONLINE_JUDGE )
#define debug
#endif
const int mx = 500005;
char names[15];
int name_count;
const int inf = 1023456789;

struct NODE {
    int s;
    int t;
    int l;
    NODE() {}
    NODE(char *_s) {
        this->l = strlen(_s);
        this->s = _s[0]-'a';
        this->t = _s[this->l-1]-'a';
    }
};
NODE vi[mx];

inline void read() {
    scanf("%d\n",&name_count);
    fo(i,name_count) {
        gets(names);
        vi[i] = NODE(names);
    }
}
int dp[26];
inline int go(int u) {
    fill(dp,dp+26,-inf);
    dp[u]=0;
    fo(j,name_count) {
        int s=vi[j].s;//from
        int t=vi[j].t;//to
        int l =vi[j].l;//length
        dp[t]=max(dp[t], dp[s]+l);
    }
    //cout<<u<<' '<<dp[u]<<'\n';
    return dp[u];
}
inline void proc() {
    int bst=-inf;
//    fo(i,name_count){
//        printf("%d %d %d\n",vi[i].s, vi[i].t,vi[i].l);
//    }
//    line;
    fo(i,26) {
        bst=max(bst, go(i) );
    }
    cout<<bst;
    line;
}
int main() {
    int kase=1;
#if !defined ( ONLINE_JUDGE )
    freopen("in","r",stdin);
    kase=1;
#endif
    fo(i,kase) {
        read();
        proc();
    }
    return 0;
}


